Course : Algorithmic Game Theory VU University Amsterdam Lecture 11
نویسنده
چکیده
Intuitively, player i is only interested in getting the items in Σi (or some more) and its valuation for these items is θi. Note that in the single-minded case every player simply reports a pair (Si,bi) (not necessarily equal to (Σi,θi)) to the auctioneer. Thus, the input can be represented compactly and is polynomial in n and m. The allocation problem for the single-minded case is as follows: Given the bids {(Si,bi)i∈N}, determine a subset W ⊆ N of winners such that Si∩S j = / 0 for every i, j ∈W , i 6= j, with maximum social welfare ∑i∈W bi.
منابع مشابه
Lectures on Frugal Mechanism Design
These lecture notes cover two lectures from EECS 510, Algorithmic Mechanism Design, offered at Northwestern University in the Spring 2008 term. They cover the topic of frugality in mechanism design. Prerequisites for reading these lecture notes are basic understanding of algorithms and complexity as well as elementary calculus and probability theory. I will also assume that the reader has acces...
متن کامل5 . Applications to streaming
In this lecture, we will see applications of communication complexity to proving lower bounds for streaming algorithms. Towards the end of the lecture, we will introduce combinatorial auctions, and we will see applications of communication complexity to auctions in the next lecture. The references for this lecture include Lecture 7 of Troy Lee’s course on communication complexity [Lee10], Lectu...
متن کاملCS 364 A : Algorithmic Game Theory Lecture # 2 : Mechanism Design Basics ∗
Consider a seller that had a single good, such as a slightly antiquated smartphone. This is the setup in a typical eBay auction, for example. There is some number n of (strategic!) bidders who are potentially interested in buying the item. We want to reason about bidder behavior in various auction formats. To do this, we need a model of what a bidder wants. The first key assumption is that each...
متن کاملLectures on Optimal Mechanism Design
These lecture notes cover the second third of the class CS364B, Topics in Algorithmic Game Theory, offered at Stanford University in the Fall 2005 term. They cover the topic of optimal mechanism design. As this is a traditional economic objective, we will review the Economics treatment of optimal mechanism design first before moving on to cover recent work on the problem from the theoretical co...
متن کاملCS 364 A : Algorithmic Game Theory Lecture # 18 : From External Regret to Swap Regret and the Minimax Theorem ∗
Last lecture we proved that coarse correlated equilibria (CCE) are tractable, in a satisfying sense: there are simple and computationally efficient learning procedures that converge quickly to the set of CCE. Of course, if anything in our equilibrium hierarchy (Figure 1) was going to be tractable, it was going to be CCE, the biggest set. The good researcher is never satisfied and always seeks s...
متن کامل